A Linear Kernel on Strongly Typed Terms
نویسندگان
چکیده
Support vector machines and other kernel methods have successfully been applied to various tasks in attribute-value learning. A kernel function is any function in input space that corresponds to an inner product in some feature space. In this discussion paper, we propose a kernel function on strongly typed first-order terms, and we show how this kernel corresponds to the linear inner product in a feature space containing a propositionalised description of the individuals.
منابع مشابه
The solving linear one-dimemsional Volterra integral equations of the second kind in reproducing kernel space
In this paper, to solve a linear one-dimensional Volterra integral equation of the second kind. For this purpose using the equation form, we have defined a linear transformation and by using it's conjugate and reproducing kernel functions, we obtain a basis for the functions space.Then we obtain the solution of integral equation in terms of the basis functions. The examples presented in this ...
متن کاملThe Comparison of Typed and Handwritten Essays of Iranian EFL Students in terms of Length, Spelling, and Grammar
This study attempted to compare typed and handwritten essays of Iranian EFL students in terms of length, spelling, and grammar. To administer the study, the researchers utilized Alice Touch Typing Tutor software to select 15 upper intermediate students with higher ability to write two essays: one typed and the other handwritten. The students were both males and females between the ages of 22 to...
متن کاملStrong Normalization of the Typed λws-calculus
The λws-calculus is a λ-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λws are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translati...
متن کاملStrong Normalization of the Typed lambda ws-calculus
The λws-calculus is a λ-calculus with explicit substitutions introduced in [4]. It satisfies the desired properties of such a calculus: step by step simulation of β, confluence on terms with meta-variables and preservation of the strong normalization. It was conjectured in [4] that simply typed terms of λws are strongly normalizable. This was proved in [7] by Di Cosmo & al. by using a translati...
متن کاملIncreasing the accuracy of the classification of diabetic patients in terms of functional limitation using linear and nonlinear combinations of biomarkers: Ramp AUC method
The Area under the ROC Curve (AUC) is a common index for evaluating the ability of the biomarkers for classification. In practice, a single biomarker has limited classification ability, so to improve the classification performance, we are interested in combining biomarkers linearly and nonlinearly. In this study, while introducing various types of loss functions, the Ramp AUC method and some of...
متن کامل